How to Specify a Graph Transformation Approach
نویسندگان
چکیده
منابع مشابه
How to Specify a Graph Transformation Approach - A Meta Model for Fujaba
Application-oriented approaches to graph transformation provide structural features beyond vertices and edges, like composition in hierarchical graphs, inheritance in object-oriented graphs, multiplicity constraints, etc. Often, these features have a specific dynamic interpretation which requires complex embedding mechanisms and context conditions. For example, the deletion of a compound node u...
متن کاملHow to Uniformly Specify Program Analysis and Transformation with Graph Rewrite Systems
Abs t r ac t . Implementing program optimizers is a task which swallows an enourmous amount of man-power. To reduce development time a simple and practial specification method is highly desirable. Such a method should comprise both program analysis and transformation. However, although several frameworks for program analysis exist, none of them can be used for analysis and transformation unifor...
متن کاملHow to Specify Security Services: A Practical Approach
Security services are essential for ensuring secure communications. Typically no consideration is given to security requirements during the initial stages of system development. Security is only added latter as an afterthought in function of other factors such as the environment into which the system is to be inserted, legal requirements, and other kinds of constraints. In this work we introduc...
متن کاملAlgebraic Approach to Single-Pushout Graph Transformation
The single-pushout approach to graph transformation interprets a double-pushout transformation rule of the classical algebraic approach which consists of two rotul graph morphisms as a single particll morphism from the left-to the right-hand side. The notion of a double-pushout diagram for the transformation process can then be substituted by a single-pushout diagram in an appropriate category ...
متن کاملA Heterogeneous Pushout Approach to Term-Graph Transformation
We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L,R, τ, σ) such that L and R are termgraphs representing the left-hand and the right-hand sides of the rule, τ is a mapping from the nodes of L to those of R and σ is a partial function from nodes of R to nodes of L. τ describes how incident edges of the nodes in L are co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2001
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80942-3